Using WordNet to Automatically Deduce Relations between Words in Noun-Noun Compounds

نویسندگان

  • Fintan J. Costello
  • Tony Veale
  • Simon Dunne
چکیده

We present an algorithm for automatically disambiguating noun-noun compounds by deducing the correct semantic relation between their constituent words. This algorithm uses a corpus of 2,500 compounds annotated with WordNet senses and covering 139 different semantic relations (we make this corpus available online for researchers interested in the semantics of noun-noun compounds). The algorithm takes as input the WordNet senses for the nouns in a compound, finds all parent senses (hypernyms) of those senses, and searches the corpus for other compounds containing any pair of those senses. The relation with the highest proportional cooccurrence with any sense pair is returned as the correct relation for the compound. This algorithm was tested using a ’leaveone-out’ procedure on the corpus of compounds. The algorithm identified the correct relations for compounds with high precision: in 92% of cases where a relation was found with a proportional cooccurrence of 1.0, it was the correct relation for the compound being disambiguated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpreting Noun Compounds using Bootstrapping and Sense Collocation

This paper describes a bootstrapping method for automatically tagging noun compounds with their corresponding semantic relations. Our work takes advantage of the collocation of senses of the noun compound constituents and also word similarity. We exploit this to generate a set of noun compounds from a set of previously tagged noun compounds by replacing one constituent of each noun compound wit...

متن کامل

Automatic Interpretation of Noun Compounds Using WordNet Similarity

The paper introduces a method for interpreting novel noun compounds with semantic relations. The method is built around word similarity with pretagged noun compounds, based on WordNet::Similarity. Over 1,088 training instances and 1,081 test instances from the Wall Street Journal in the Penn Treebank, the proposed method was able to correctly classify 53.3% of the test noun compounds. We also i...

متن کامل

Assessing Text Readability Using Hierarchical Lexical Relations Retrieved from WordNet

Although some traditional readability formulas have shown high predictive validity in the r = 0.8 range and above (Chall & Dale, 1995), they are generally not based on genuine linguistic processing factors, but on statistical correlations (Crossley et al., 2008). Improvement of readability assessment should focus on finding variables that truly represent the comprehensibility of text as well as...

متن کامل

An Application of WordNet to Prepositional Attachment

This paper presents a method for word sense disambiguation and coherence understanding of prepositional relations. The method relies on information provided by WordNet 1.5. We rst classify preposi-tional attachments according to semantic equivalence of phrase heads and then apply inferential heuristics for understanding the validity of prepositional structures. 1 Problem description In this pap...

متن کامل

CS 224N Class Project Automatic Hypernym Classification

Hypernym classification is the task of deciding whether, given two words, one word “is a kind of” the other. We present a classifier that learns the noun hypernym relation based on automatically-discovered lexico-syntactic patterns between a set of provided hyponym/hypernym noun pairs. This classifier is shown to outperform two previous methods for automatically identifying hypernym pairs (usin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006